Game-Based Memetic Algorithm to the Vertex Cover of Networks
نویسندگان
چکیده
منابع مشابه
A Memetic Algorithm for Vertex-Biconnectivity Augmentation
This paper considers the problem of augmenting a given graph by a cheapest possible set of additional edges in order to make the graph vertex-biconnected. A real-world instance of this problem is the enhancement of an already established computer network to become robust against single node failures. The presented memetic algorithm includes an effective preprocessing of problem data and a fast ...
متن کاملThe Applicability of Genetic algorithm to Vertex Cover
The Vertex Cover Problem calls for the selection of a set of vertices(V) in a way that all the edges of the graph, connected to those vertices constitute the set E of the given graph G= (V, E). The problem finds applications in various fields and is therefore, one of the most widely researched topics in NP Complete Problems. The problem is an NP Complete problem this work proposes a Genetic Alg...
متن کاملA Memetic Genetic Algorithm for the Vertex p-center Problem
The p-center problem is one of choosing p facilities from a set of candidates to satisfy the demands of n clients in order to minimize the maximum cost between a client and the facility to which it is assigned. In this article, PBS, a population based meta-heuristic for the p-center problem, is described. PBS is a genetic algorithm based meta-heuristic that uses phenotype crossover and directed...
متن کاملA memetic algorithm for the weighted feedback vertex set problem
Given an undirected and vertex weighted graph G = (V,E,w), the Weighted Feedback Vertex Set Problem consists of finding the subset F ⊆ V of vertices, with minimum weight, whose removal results in an acyclic graph. Finding the minimum feedback vertex set in a graph is an important combinatorial problem that has a variety of real applications. In this paper we introduce a memetic algorithm for th...
متن کاملA new memetic algorithm based on cellular learning automata for solving the vertex coloring problem
Vertex coloring problem is a combinatorial optimization problem in graph theory in which a color is assigned to each vertex of graph such that no two adjacent vertices have the same color. In this paper a new hybrid algorithm which is obtained from combination of cellular learning automata (CLA) and memetic algorithm (MA) is proposed for solving the vertex coloring problem. CLA is an effective ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Cybernetics
سال: 2019
ISSN: 2168-2267,2168-2275
DOI: 10.1109/tcyb.2018.2789930